Probabilistic Self-Scheduling for Coverage Configuration in Sensor Networks
نویسندگان
چکیده
Sensing coverage is a critical issue in sensor network deployments. We propose a novel scheme to maintain the sensing coverage in sensor networks, which we call CASS (Coverage-Aware Self-Scheduling). Different from the existing work on coverage maintenance, CASS probabilistically schedules a sensor’s sensing activities according to the sensor’s contribution to the sensing coverage. CASS is designed to allow sensors with higher coverage contribution to have more chance to be active. In this way, CASS reduces the number of active sensors to maintain certain coverage. Besides the sensing coverage, the connectivity of the network topologies is required for the purposes of communicating among sensors to collect sensing data. Therefore, we describe a generic unifying framework to incorporate different connectivity and coverage maintenance schemes. Simulations are carried out under the framework by integrating CASS with LEACH (the Low Energy Adaptive Clustering Hierarchy). Simulation results show that CASS can considerably improve the energy efficiency of a sensor network with low overhead.
منابع مشابه
Probabilistic self-scheduling for coverage configuration in wireless ad-hoc sensor networks
Sensing coverage is a critical issue in sensor network deployments. We propose a novel scheme to maintain the sensing coverage in sensor networks, which we call CASS (Coverage-Aware Self-Scheduling). Different from the existing work on coverage maintenance, CASS probabilistically schedules sensing activities according to the sensor’s contribution to the sensing coverage of the whole sensor netw...
متن کاملImproving Energy-Efficient Target Coverage in Visual Sensor Networks
Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...
متن کاملPre-Scheduled and Self Organized Sleep-Scheduling Algorithms for Efficient K-Coverage in Wireless Sensor Networks
The K-coverage configuration that guarantees coverage of each location by at least K sensors is highly popular and is extensively used to monitor diversified applications in wireless sensor networks. Long network lifetime and high detection quality are the essentials of such K-covered sleep-scheduling algorithms. However, the existing sleep-scheduling algorithms either cause high cost or cannot...
متن کاملSleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined coverage and connectiv...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005